Ergodic Averages over Sparse Random Subsequences
نویسنده
چکیده
We prove an L subsequence ergodic theorem for sequences chosen by independent random selector variables, thereby showing the existence of sparser universally L-good sequences than had been previously established. We extend this theorem to a more general setting of ergodic group actions.
منابع مشابه
Ergodic Theorems for Random Group Averages
This is an earlier, but more general, version of ”An L Ergodic Theorem for Sparse Random Subsequences”. We prove an L ergodic theorem for averages defined by independent random selector variables, in a setting of general measure-preserving group actions. A far more readable version of this paper is in the works.
متن کاملErgodic Theorems over Sparse Random Subsequences
We prove an L subsequence ergodic theorem for sequences chosen by independent random selector variables, thereby showing the existence of universally L-good sequences nearly as sparse as the set of squares. We extend this theorem to a more general setting of measure-preserving group actions. In addition, we use the same technique to prove an L almost everywhere convergence result for a modulate...
متن کاملAn L Ergodic Theorem for Sparse Random Subsequences
We prove an L subsequence ergodic theorem for sequences chosen by independent random selector variables, thereby showing the existence of universally L-good sequences nearly as sparse as the set of squares. In the process, we prove that a certain deterministic condition implies a weak maximal inequality for a sequence of l convolution operators (Prop. 3.1).
متن کاملWeighted Ergodic Theorems Along Subsequences of Density Zero
We consider subsequence versions of weighted ergodic theorems, and show that for a wide class of subsequences along which a.e. convergence of Cesaro averages has been established, we also have a.e. convergence for the subsequence Cesaro weighted averages, when the weights are obtained from uniform sequences produced by a connected apparatus.
متن کاملRandom Graphs And The Strong Convergence Of Bootstrap Means
We consider graphs Gn generated by multisets In with n random integers as elements, such that vertices of Gn are connected by edges if the elements of In that the vertices represent are the same, and prove asymptotic results on the sparsity of edges connecting the different subgraphs Gn of the random graph generated by ∪∞n=1In. These results are of independent interest and, for two models of th...
متن کامل